Alignment correspondences

Alignment Correspondences

φ : R→̃ÔX,p with φ(I1, . . . , Ir) = (a1, . . . , ar)} and its closure C(I1, . . . , Ir) in the appropriate product of Hilbert schemes. If the ideals Ij are monomial, we will say that the space C(I1, . . . , Ir) is an alignment correspondenceswith interior U(I1, . . . , Ir). The significance of the Ij’s being monomial is that in this case we can show that the space U(I1, . . . , Ir) in most case...

Linear and Nonlinear Shape Alignment without Correspondences

Manifold Alignment Determination: finding correspondences across different data views

We present Manifold Alignment Determination (MAD), an algorithm for learning alignments between data points from multiple views or modalities. The approach is capable of learning correspondences between views as well as correspondences between individual data-points. The proposed method requires only a few aligned examples from which it is capable to recover a global alignment through a probabi...

FaMSA: Fast Multi-Scan Alignment with Partially Known Correspondences

This paper presents FaMSA, an efficient method to boost 3D scan registration from partially known correspondence sets. This situation is typical at loop closure in large laser-based mapping sessions. In such cases, scan registration for consecutive point clouds has already been made during open loop traverse, and the point match history can be used to speed up the computation of new scan matche...

Learning Audio-Sheet Music Correspondences for Score Identification and Offline Alignment

This work addresses the problem of matching short excerpts of audio with their respective counterparts in sheet music images. We show how to employ neural networkbased cross-modality embedding spaces for solving the following two sheet music-related tasks: retrieving the correct piece of sheet music from a database when given a music audio as a search query; and aligning an audio recording of a...